Haplotypes histories as pathways of recombinations
نویسندگان
چکیده
منابع مشابه
Haplotypes histories as pathways of recombinations
MOTIVATION The diversity of a haplotype, represented as a string of polymorphic sites along a DNA sequence, increases exponentially with the number of sites if recombinations are taking place. Reconstructing the history of recombinations compared with that of the polymorphic sites is thus extremely difficult. However, in the human genome, because of the relatively simple pattern of haplotype di...
متن کاملDNA analysis of ancient dogs of the Americas: identifying possible founding haplotypes and reconstructing population histories.
As dogs have traveled with humans to every continent, they can potentially serve as an excellent proxy when studying human migration history. Past genetic studies into the origins of Native American dogs have used portions of the hypervariable region (HVR) of mitochondrial DNA (mtDNA) to indicate that prior to European contact the dogs of Native Americans originated in Eurasia. In this study, w...
متن کاملQuantum jumps as decoherent histories
Quantum open systems are described in the Markovian limit by master equations in Lindblad form. I argue that common “quantum jumps” techniques, which solve the master equation by unraveling its evolution into stochastic trajectories in Hilbert space, correspond closely to a particular set of decoherent histories. This is illustrated by a simple model of a photon counting experiment. Recently a ...
متن کاملToward More Powerful Recombinations
This paper suggests a exible framework for n-dimensional crossover, consisting of cutting, classi cation, and copying of genes. We prove that under this framework, any cutting strategy generates two equivalence classes of genes, making the framework appropriate as a crossover scheme. Three notable features of this framework are: (i) it enables more e ective use of genes' geographical linkage, (...
متن کاملRecombinations of Busy Beaver Machines
Many programmers belive that Turing-based machines cannot think. We also believe in this, however it is interesting to note that the most sophisticated machines are not programmed by human beings. We have only discovered them. In this paper, using well-known Busy Beaver and Placid Platypus machines, we generate further very similar, but not exactly the same machines. We have found a recombinate...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bioinformatics
سال: 2004
ISSN: 1367-4803,1460-2059
DOI: 10.1093/bioinformatics/bth148